Lecture 9 Threshold Phenomena
نویسنده
چکیده
Though our main technical result concerns random graphs in the G(n,p) model, let us mention other contexts in which threshold phenomena occur. One classical example is Percolation, an area started in physics. A typical question here is this: given a planar grid and 0 < p < 1. Create a graph by keeping each edge of the planar grid with probability p and removing each edge with probability 1-p. The inclusion of edges is done independently. Our question is then: In the resulting graph is the origin in an infinite connected component?
منابع مشابه
Index of Books I-i I Correlation of Exposition of St . Thomas with the Text of Aristotle Meteorology
Lecture 4 -j hrL.v questions. The first, on the order of the elements is solved 10 Lecture 5 --The remaining two questions solved 13 Lecture 6 -Shooting stars and meteors -cause and difference 16 Lecture 7 -Solution of problems concerning shooting stars 18 Lecture 8 -Cause of other phenomena appearing at night, and o f certain that do not 20 Lecture 9 -The opinions of others concerning comets 2...
متن کاملLecture 23: Threshold Phenomena 2 Infinite Graphs
where the subscript x ∼ pmeans each bit of the input x is set to -1 with probability p independently. Last lecture we argued that μp(f) is a nondecreasing function in p. We also defined the function’s critical probability pc as the least p such that μp(f) is at least 1 2 . In fact, in the case of finite domains we showed that μp(f) is increasing from 0 to 1 when p goes from 0 to 1, so pc is the...
متن کاملLecture 9 : Expanders Part 2 , Extractors
In the previous lecture we saw the definitions of eigenvalue expanders, edge expanders, and vertex expanders for d-regular graphs. To recap, in an eigenvalue expander, all except the first eigenvalue of the graph’s adjacency matrix are bounded below d. In an edge expander, every subset of vertices of size below a certain threshold has a large number of edges “going out” of the subset. And in a ...
متن کاملBoolean Functions: Influence, threshold and noise
This lecture studies the analysis of Boolean functions and present a few ideas, results, proofs, and problems. We start with the wider picture of expansion in graphs and then concentrate on the graph of the n-dimensional discrete cube Ωn. Boolean functions are functions from Ωn to {0, 1}. We consider the notion of the influence of variables on Boolean functions. The influence of a variable on a...
متن کاملLecture 9 : AC 0 Circuit Size of SUB ( G ) , Continued
Throughout today’s lecture, we fix a connected graph G and a strict threshold weighting θ : E(G)→ [0, 2] (such that ∆θ(H) := |V (H)| − ∑ e∈E(H) θ(e) > 0 for all ∅ ⊂ H ⊂ G). Also throughout today’s lecture, let α be a uniform random element of [n]V (G) (independent of Xθ). We think of α as a random choice of vertices from each color class of G ↑n. For each subgraph H ⊆ G, we have the isomorphic ...
متن کامل